Parametri Shape Analysis via 3-Valued Logi
نویسنده
چکیده
منابع مشابه
7 D ec 2 00 3 Logical Characterizations of Heap Abstractions
Shape analysis concerns the problem of determining " shape invari-ants " for programs that perform destructive updating on dynamically allocated storage. In recent work, we have shown how shape analysis can be performed, using an abstract interpretation based on 3-valued first-order logic. In that work, concrete stores are finite 2-valued logical structures, and the sets of stores that can poss...
متن کاملar X iv : c s / 03 12 01 4 v 2 [ cs . L O ] 1 1 A pr 2 00 4 Logical Characterizations of Heap Abstractions
Shape analysis concerns the problem of determining " shape invari-ants " for programs that perform destructive updating on dynamically allocated storage. In recent work, we have shown how shape analysis can be performed, using an abstract interpretation based on 3-valued first-order logic. In that work, concrete stores are finite 2-valued logical structures, and the sets of stores that can poss...
متن کامل3D Shape Description and Matching Based on Properties of Real Functions
This tutorial covers a variety of methods for 3D shape matching and retrieval that are characterized by the use of a real-valued function defined on the shape (mapping function) to derive its signature. The methods are discussed following an abstract conceptual framework that distinguishes among the three main components of these class of shape matching methods: shape analysis, via the applicat...
متن کاملModal Transition Systems: A Foundation for Three-Valued Program Analysis
We present Kripke modal transition systems (Kripke MTSs), a generalization of modal transition systems [27,26], as a foundation for three-valued program analysis. The semantics of Kripke MTSs are presented by means of a mixed power domain of states; soundness and consistency are proved. Two major applications, model checking partial state spaces and three-valued program shape analysis, are pres...
متن کامل